- bubble sort method
- метод "пузырька"
Англо-русский словарь компьютерных и интернет терминов. 2013.
bubble sort method
Смотреть что такое "bubble sort method" в других словарях:
bubble sort — noun (computing) A method of sorting items of data in a list by repeatedly scanning the list and putting adjacent pairs of items in order • • • Main Entry: ↑bubble … Useful english dictionary
Bubble memory — Computer memory types Volatile RAM DRAM (e.g., DDR SDRAM) SRAM In development T RAM Z RAM TTRAM Historical Delay line memory Selectron tube Williams tube … Wikipedia
Comb sort — Class Sorting algorithm Data structure Array Worst case performance O(n log n)[1] … Wikipedia
Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… … Wikipedia
Merge sort — Example of merge sort sorting a list of random dots. Class Sorting algorithm Data structure Array Worst case performance O(n log n) … Wikipedia
Selection sort — Infobox Algorithm class=Sorting algorithm data=Array time= О(n²) space= О(n) total, O(1) auxiliary optimal=Not usuallySelection sort is a sorting algorithm, specifically an in place comparison sort. It has O( n 2) complexity, making it… … Wikipedia
Odd–even sort — Example of odd even transposition sort sorting a list of random numbers. Class Sorting algorithm Data structure Array Worst case performance … Wikipedia
Internal sort — An internal sort is any data sorting process that takes place entirely within the main memory of a computer. This is possible whenever the data to be sorted is small enough to all be held in the main memory. For sorting larger datasets, it may be … Wikipedia
Insertion sort — Infobox Algorithm class=Sorting algorithm data=Array time= О(n²) space= О(n) total, O(1) auxiliary optimal=Not usuallyInsertion sort is a simple sorting algorithm, a comparison sort in which the sorted array (or list) is built one entry at a time … Wikipedia
Cycle sort — Example of cycle sort sorting a list of random numbers. Class Sorting algorithm Data structure Array Worst case performance Θ(n2) … Wikipedia
Kemeny–Young method — Part of the Politics series Electoral methods Single winner … Wikipedia
